An Oppenheim type inequality for positive definite block matrices
نویسندگان
چکیده
We present an Oppenheim type determinantal inequality for positive definite block matrices. Recently, Lin [Linear Algebra Appl. 2014;452:1–6] proved a remarkable extension of matrices, which solved conjecture Günther and Klotz. There is requirement that two matrices commute in Lin's result. The motivation this paper to obtain another natural general get rid the commute.
منابع مشابه
A New Determinant Inequality of Positive Semi-Definite Matrices
A new determinant inequality of positive semidefinite matrices is discovered and proved by us. This new inequality is useful for attacking and solving a variety of optimization problems arising from the design of wireless communication systems. I. A NEW DETERMINANT INEQUALITY The following notations are used throughout this article. The notations [·] and [·] stand for transpose and Hermitian tr...
متن کاملA Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices
where B and D are square blocks. We prove the following inequalities for the Schatten q-norm ||.||q , which are sharp when the blocks are of size at least 2× 2: ||A||q ≤ (2 q − 2)||C||q + ||B|| q q + ||D|| q q, 1 ≤ q ≤ 2, and ||A||q ≥ (2 q − 2)||C||q + ||B|| q q + ||D|| q q, 2 ≤ q. These bounds can be extended to symmetric partitionings into larger numbers of blocks, at the expense of no longer...
متن کاملRiemannian Sparse Coding for Positive Definite Matrices
Inspired by the great success of sparse coding for vector valued data, our goal is to represent symmetric positive definite (SPD) data matrices as sparse linear combinations of atoms from a dictionary, where each atom itself is an SPD matrix. Since SPD matrices follow a non-Euclidean (in fact a Riemannian) geometry, existing sparse coding techniques for Euclidean data cannot be directly extende...
متن کاملDeterminantal inequalities for positive definite matrices
Let Ai , i = 1, . . . ,m , be positive definite matrices with diagonal blocks A ( j) i , 16 j 6 k , where A ( j) 1 , . . . ,A ( j) m are of the same size for each j . We prove the inequality det( m ∑ i=1 A−1 i ) > det( m ∑ i=1 (A (1) i ) −1) · · ·det( m ∑ i=1 (A (k) i ) −1) and more determinantal inequalities related to positive definite matrices.
متن کاملAn Incomplete Cholesky Factorization for Dense Symmetric Positive Definite Matrices
In this paper, we study the use of an incomplete Cholesky factorization (ICF) as a preconditioner for solving dense symmetric positive definite linear systems. This method is suitable for situations where matrices cannot be explicitly stored but each column can be easily computed. Analysis and implementation of this preconditioner are discussed. We test the proposed ICF on randomly generated sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear & Multilinear Algebra
سال: 2021
ISSN: ['0308-1087', '1026-7573', '1563-5139']
DOI: https://doi.org/10.1080/03081087.2021.1882370